New Recursive Algorithms for the Unified Forward and Inverse MDCT/MDST
نویسندگان
چکیده
Forward and inverse MDCT are two of the most computationally intensive operations in the MPEG audio coding standard. In this paper we derive sinusoidal recursive formulas for transforming kernels of the MDCT/MDST and IMDCT/IMDST. Then we efficiently implement MDCT/MDST and IMDCT/IMDST of the general length using the regressive structure derived from the sinusoidal recursive formulas. The proposed regular structure is particularly suitable for parallel VLSI realization. Our solution requires significantly less operations as well as less hardware compared with a recently proposed one.
منابع مشابه
Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks
A new fast computational structure identical both for the forward and backward modified discrete cosine/sine transform (MDCT/MDST) computation is described. It is the result of a systematic construction of a fast algorithm for an efficient implementation of the complete time domain aliasing cancelation (TDAC) analysis/synthesis MDCT/ MDST filter banks. It is shown that the same computational st...
متن کاملA Note on the MDCT/MDST and Pseudoinverse Matrix
Abstract. The modified discrete cosine transform (MDCT) and modified discrete sine transform (MDST) both for the evenly and oddly stacked systems are perfect reconstruction cosine/sine–modulated filter banks based on time domain aliasing cancellation (TDAC) employed in the current international audio coding standards and commercial audio compression products. Based on the matrix representation ...
متن کاملMixed-radix Algorithm for the Computation of Forward and Inverse MDCT
The modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) are two of the most computational intensive operations in MPEG audio coding standards. A new mixed-radix algorithm for efficient computing the MDCT/IMDCT is presented. The proposed mixed-radix MDCT algorithm is composed of two recursive algorithms. The first algorithm, called the radix-2 decimation in frequency (DIF) algorit...
متن کاملILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملInteger fast modified cosine transform
In this paper, an efficient implementation of the forward and inverse MDCT is proposed for even-length MDCT. The algorithm uses discrete cosine transform of type II (DCT-II) to compute the forward MDCT and their inverse DCT-III to compute the inverse MDCT. The lifting scheme is used to approximate multiplications appearing in the MDCT lattice structure where the dynamic range of the lifting coe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- VLSI Signal Processing
دوره 34 شماره
صفحات -
تاریخ انتشار 2003